• An efficient bill-of-materials algorithm 

      Khalaila, Ahmad; Eliassen, Frank (Research report; Forskningsrapport, 1997-04)
      A large class of linear recursive queries compute the bill-of-materials of database relations.This paper presents a novel algorithm that computes the bill-of-materials of its argument's (database) relation. The algorithm uses a special join operation that accumulates the cost of composite parts, without constructing the transitive closure of the argument relation, thus saving time and space. We ...
    • Efficient bill-of-materials algorithms 

      Beeri, Catriel; Khalaila, Ahmad; Eliassen, Frank (Research report; Forskningsrapport, 1996-09-01)
      It has been shown that every linearly recursive database query can be expressed as a transitive closure possibly preceded and followed by relational algebraic operations. A large class of such queries computes the bill-of-materials of database relations. This paper presents efficient sequential and distributed algorithms that compute the bill-of-materials of a database relation. These algorithms ...